Asymptotically almost all λ-terms are strongly normalizing
نویسندگان
چکیده
منابع مشابه
Asymptotically almost all λ - terms are strongly normalizing ∗
We present a quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results show that asymptotically, almost all terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators), the result is exactly opposite. We show that almos...
متن کاملAsymptotically almost all \lambda-terms are strongly normalizing
We present quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators) the result is exactly opposite. We show that almost all te...
متن کاملAlmost All Palindromes Are Composite
We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite. ∗MSC Numbers: 11A63, 11L07, 11N69 †Corresponding author 1
متن کاملStrongly Normalizing Audited Computation
Auditing is an increasingly important operation for computer programming, for example in security (e.g. to enable history-based access control) and to enable reproducibility and accountability (e.g. provenance in scientific programming). Most proposed auditing techniques are ad hoc or treat auditing as a second-class, extralinguistic operation; logical or semantic foundations for auditing are n...
متن کاملAlmost All Complex Quantifiers Are Simple
We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(1:2)2013